Petri Nets With Persistence
نویسندگان
چکیده
منابع مشابه
Petri Nets With Persistence
Persistence of information is common in modern computer systems. This paper describes how to extend Petri nets, a traditional model of concurrent and distributed computations, to take account of conditions that are persistent. We found use for this kind of nets in modelling untrustworthy networks on which messages are exchanged according to a security protocol. The paper explains a construction...
متن کاملEvent Structures for Petri nets with Persistence
Event structures are a widely accepted model of concurrency. In a seminal paper by Nielsen, Plotkin and Winskel, they are used to establish a bridge between the theory of domains and the approach to concurrency proposed by Petri. A basic role is played by an unfolding construction that maps (safe) Petri nets into a subclass of event structures where each event has a uniquely determined set of c...
متن کاملSystem Modelling with Petri Nets
Petri Nets (PN) are a graphical formalism which is gaining popularity in recent years as a tool for the representation of complex logical interactions (like synchronization, sequentiality, concurrency and conflict) among physical components or activities in a system. This notes are devoted to introduce the formalism of Petri nets with particular emphasis on the application of the methodology in...
متن کاملImproving UML with Petri nets
UML is the OMG standard notation for object-oriented modeling. It is easy, graphical and appealing, but in several cases still too imprecise. UML is strong as modeling means, supplies several different diagrammatic notations for representing the different aspects of a system under development, but lacks simulation and verifiability capabilities. This drawback comes from its semi-formal nature: ...
متن کاملPetri Nets with Structured Data
This paper proposes Structured Data Nets (StDN), a Petri net extension that describes transactional systems with data. In StDNs, tokens are structured documents. Each transition is attached to a query, guarded by patterns, (logical assertions on the contents of its preset) and transforms tokens. We define StDNs and their semantics. We then consider their formal properties: coverability of a mar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2005
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2004.10.012